New fusion rules for solving Blackman’s association problem
نویسندگان
چکیده
This chapter presents a new approach for solving the paradoxical Blackman’s association problem. It utilizes a new class of fusion rules based on fuzzy T-conorm/T-norm operators together with Dezert-Smarandache theory and the relative variations of generalized pignistic probabilities measure of correct associations defined from a partial ordering function of hyper-power set. The ability of this approach to solve the problem against the classical DempsterShafer’s method, proposed in the literature is proven. It is shown that the approach improves the separation power of the decision process for this association problem. This work is partially supported by MONT grant MI-1506/05.
منابع مشابه
On the Blackman’s Association Problem
Modern multitarget-multisensor tracking systems involve the development of reliable methods for the data association and the fusion of multiple sensor information, and more specifically the partioning of observations into tracks. This paper discusses and compares the application of Dempster-Shafer Theory (DST) and the Dezert-Smarandache Theory (DSmT) methods to the fusion of multiple sensor att...
متن کاملA New Class Fusion Rule for solving Blackman ' s Association Problem
⎯This paper presents a new approach for solving the paradoxical Blackman's Association Problem. It utilizes the recently defined new class fusion rule based on fuzzy Tconorm/T-norm operators together with DezertSmarandache theory based, relative variations of generalized pignistic probabilities measure of correct associations, defined from a partial ordering function of hyper-power set. The abi...
متن کاملA new approach based on data envelopment analysis with double frontiers for ranking the discovered rules from data mining
Data envelopment analysis (DEA) is a relatively new data oriented approach to evaluate performance of a set of peer entities called decision-making units (DMUs) that convert multiple inputs into multiple outputs. Within a relative limited period, DEA has been converted into a strong quantitative and analytical tool to measure and evaluate performance. In an article written by Toloo et al. (2009...
متن کاملAn imperialist competitive algorithm for solving the production scheduling problem in open pit mine
Production scheduling (planning) of an open-pit mine is the procedure during which the rock blocks are assigned to different production periods in a way that the highest net present value of the project achieved subject to operational constraints. The paper introduces a new and computationally less expensive meta-heuristic technique known as imperialist competitive algorithm (ICA) for long-term...
متن کاملA Set of Algorithms for Solving the Generalized Tardiness Flowshop Problems
This paper considers the problem of scheduling n jobs in the generalized tardiness flow shop problem with m machines. Seven algorithms are developed for finding a schedule with minimum total tardiness of jobs in the generalized flow shop problem. Two simple rules, the shortest processing time (SPT), and the earliest due date (EDD) sequencing rules, are modified and employed as the core of seque...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2016